Neighborly inscribed polytopes and Delaunay triangulations

نویسندگان

  • Bernd Gonska
  • Arnau Padrol
چکیده

We prove that there are superexponentially many combinatorially distinct d-dimensional neighborly Delaunay triangulations on n points. These are the first examples of neighborly Delaunay triangulations that cannot be obtained via a stereographic projection of an inscribed cyclic polytope, and provide the current best lower bound for the number of combinatorial types of Delaunay triangulations. To prove this bound we combine recent results on constructions for neighborly and inscribable polytopes to obtain a very simple explicit technique to generate a rich family of inscribable neighborly polytopes, and hence of point configurations with neighborly Delaunay triangulations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Many neighborly inscribed polytopes and Delaunay triangulations

We present a very simple explicit technique to generate a large family of point configurations with neighborly Delaunay triangulations. This proves that there are superexponentially many combinatorially distinct neighborly d-polytopes with n vertices that admit realizations inscribed on the sphere. These are the first examples of inscribable neighborly polytopes that are not cyclic polytopes, a...

متن کامل

Universality theorems for inscribed polytopes and Delaunay triangulations

We prove that every primary basic semialgebraic set is homotopy equivalent to the set of inscribed realizations (up to Möbius transformation) of a polytope. If the semialgebraic set is moreover open, then, in addition, we prove that (up to homotopy) it is a retract of the realization space of some inscribed neighborly (and simplicial) polytope. We also show that all algebraic extensions of Q ar...

متن کامل

ay 2 00 8 Notes on Convex Sets , Polytopes , Polyhedra Combinatorial Topology , Voronoi Diagrams and Delaunay Triangulations

Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended f...

متن کامل

Aspects of Convex Geometry Polyhedra, Shellings, Voronoi Diagrams, Delaunay Triangulations

Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed as a tutorial and a set of notes on convex sets, polytopes, polyhedra, combinatorial topology, Voronoi Diagrams and Delaunay Triangulations. It is intended f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1308.5798  شماره 

صفحات  -

تاریخ انتشار 2013